Suux Trees and String Complexity
نویسندگان
چکیده
Let s = (s 1 ; s 2 ; : : : ; s n) be a sequence of characters where s i 2 Z p for 1 i n. One measure of the complexity of the sequence s is the length of the shortest feedback shift register that will generate s, which is known as the maximum order complexity of s 17, 18]. We provide a proof that the expected length of the shortest feedback register to generate a sequence of length n is less than 2 log p n + o(1), and also give several other statistics of interest for distinguishing random strings. The proof is based on relating the maximum order complexity to a data structure known as a suux tree.
منابع مشابه
From Ukkonen to Mccreight and Weiner: a Unifying View of Linear-time Suux Tree Construction
We review the linear time suux tree constructions by Weiner, McCreight, and Ukkonen. We use the terminology of the most recent algorithm, Ukkonen's online construction, to explain its historic predecessors. This reveals relationships much closer than one would expect, since the three algorithms are based on rather diierent intuitive ideas. Moreover, it completely explains the diierences between...
متن کاملSuux Binary Search Trees and Suux Arrays
Suux arrays and suux binary search trees are two data structures that have been proposed as alternatives to the classical suux tree to facilitate eecient on-line string searching. Here, we explore the relationship between these two structures. In particular, we present an alternative view of a suux array, with its auxiliary information, as a perfectly balanced suux binary search tree, and descr...
متن کاملOptimal Suffix Tree Construction with Large Alphabets
The suux tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner Wei73], who introduced the data structure, gave an O(n) time algorithm algorithm for building the suux tree of an n character string drawn from a constant size alphabet. In the comparison model, there is a trivial (n log n) time lower bound based on sorting, and Weiner's algorithm matches this ...
متن کاملSpace Eecient Suux Trees
We give the rst representation of a suux tree that uses n lg n + O(n) bits of space and supports searching for a pattern string in the given text (from a xed size alphabet) in O(m) time, where n is the size of the text and m is the length of the pattern. The structure is quite simple and answers a question raised by Muthukrishnan in 22]. Previous compact representations of suux trees had either...
متن کاملOn{line Construction of Suux Trees 1
An on{line algorithm is presented for constructing the suux tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suux tree for the scanned part of the string ready. The method is developed as a linear{time version of a very simple algorithm for (quadratic s...
متن کاملIndexing for String Queries using
We present ve index trees designed for supporting string searches. We discuss Counted Trees, Substring Trees, and Regular Expression Trees, all of which suuer the same problem { their attempts at approximating a large set of data lead to an almost complete lack of information in the interior nodes. A variant of B-Trees, called a Preex-Suux Tree, avoids this diiculty by severely restricting the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992